Abstracting cryptographic protocols with tree automata

Abstracting Cryptographic Protocols with Tree Automata

ing Cryptographic Protocols with Tree Automata ?

Tree automata with one memory set constraints and cryptographic protocols

Formal Veri cation of Cryptographic Protocols using History Dependent Automata

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

Abstracting an Operational Semantics to Finite Automata

ing an operational semantics to finite automata Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker IRIT (Institut de Recherche en Informatique de Toulouse) Université de Toulouse, France firstname.lastname @irit.fr ?,?? Abstract. There is an apparent similarity between the descriptions of small-step operational semantics of imperative programs and the semantics of finite aut...